solving resource constraint project scheduling problems using modified ant colony optimization
نویسندگان
چکیده
resource constraints project scheduling problem (rspsp) seeks proper sequence of implementation of project activities in a way that the precedence relations and different type of resource constraints are met concurrently. rcpsp tends to optimize some measurement function as make-span, cost of implementation, number of tardy tasks and etc. as rcpsp is assumed as an np-hard problem so, different meta-heuristic approaches have been proposed to solve different variants of it. in this paper, a modified ant colony optimization (aco) approach has been developed to deal with rcpsp. the definition of probabilistic selection rule has been modified in proposed approach in favor of better performance. moreover, the parameters of algorithm have been determined in an adaptive manner and the stagnation behavior has been prevented in high iterations of algorithm. uncertainty of parameters of rcpsp has also been discussed. the proposed algorithm has been coded using visual basic software and tested on benchmark instance in this area. the results are promising and have been compared with optimal or best known solutions.
منابع مشابه
Ant Colony Optimization for Resource-Constrained Project Scheduling
An ant colony optimization approach (ACO) for the resource-constrained project scheduling problem (RCPSP) is presented. Combinations of two pheromone evaluation methods are used by the ants to find new solutions. We tested our ACO algorithm on a set of large benchmark problems from the PSPLIB. Compared to several other heuristics for the RCPSP including genetic algorithms, simulated annealing, ...
متن کاملOn solving permutation scheduling problems with ant colony optimization
A new approach for solving permutation scheduling problems with Ant Colony Optimization is proposed in this paper. The approach assumes that no precedence constraints between the jobs have to be fulfilled. It is tested with an ant algorithm for the Single Machine Total Weighted Deviation Problem. In the new approach ants allocate the places in the schedule not sequentially, as in the standard a...
متن کاملHybrid ant colony optimization in solving multi-skill resource-constrained project scheduling problem
In this paper Hybrid Ant Colony Optimization (HAntCO) approach in solving Multi–Skill Resource Constrained Project Scheduling Problem (MS–RCPSP) has been presented. We have proposed hybrid approach that links classical heuristic priority rules for project scheduling with Ant Colony Optimization (ACO). Furthermore, a novel approach for updating pheromone value has been proposed, based on both th...
متن کاملSolving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools
متن کامل
Solving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملStudy of Project Scheduling and Resource Allocation Using Ant Colony Optimization
Task Scheduling and Resource Allocation is an important phase in Project Management. Scheduling Problem in Software Projects is NP-complete and various algorithmic approaches have been studied to develop an optimal solution to generate a schedule, which will be cost effective, utilize resources effectively and meet the target deadline. This paper addresses the above problem in detail and review...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۵، شماره ۱، صفحات ۵۹-۶۹
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023